pakaitų izomorfizmas — statusas T sritis chemija apibrėžtis Izomorfizmas, atsirandantis dalį atomų (jonų) kristalinės gardelės mazguose pakeitus kitais. atitikmenys: angl. substitution isomorphism rus. изоморфизм замещения … Chemijos terminų aiškinamasis žodynas
изоморфизм замещения — pakaitų izomorfizmas statusas T sritis chemija apibrėžtis Izomorfizmas, atsirandantis dalį atomų (jonų) kristalinės gardelės mazguose pakeitus kitais. atitikmenys: angl. substitution isomorphism rus. изоморфизм замещения … Chemijos terminų aiškinamasis žodynas
Chinese remainder theorem — The Chinese remainder theorem is a result about congruences in number theory and its generalizations in abstract algebra. In its most basic form it concerned with determining n, given the remainders generated by division of n by several numbers.… … Wikipedia
Intuitionistic type theory — Intuitionistic type theory, or constructive type theory, or Martin Löf type theory or just Type Theory is a logical system and a set theory based on the principles of mathematical constructivism. Intuitionistic type theory was introduced by Per… … Wikipedia
Equality (mathematics) — Loosely, equality is the state of being quantitatively the same. More formally, equality (or the identity relation) is the binary relation on a set X defined by . The identity relation is the archetype of the more general concept of an… … Wikipedia
Curl (mathematics) — Topics in Calculus Fundamental theorem Limits of functions Continuity Mean value theorem Differential calculus Derivative Change of variables Implicit differentiation Taylor s theorem Related rates … Wikipedia
Combinatory logic — Not to be confused with combinational logic, a topic in digital electronics. Combinatory logic is a notation introduced by Moses Schönfinkel and Haskell Curry to eliminate the need for variables in mathematical logic. It has more recently been… … Wikipedia
Combinatorial species — In combinatorial mathematics, the theory of combinatorial species is an abstract, systematic method for analysing discrete structures in terms of generating functions. Examples of discrete structures are (finite) graphs, permutations, trees, and… … Wikipedia
Curry–Howard correspondence — A proof written as a functional program: the proof of commutativity of addition on natural numbers in the proof assistant Coq. nat ind stands for mathematical induction, eq ind for substitution of equals and f equal for taking the same function… … Wikipedia
De Morgan's laws — In formal logic, De Morgan s laws are rules relating the logical operators and and or in terms of each other via negation. With two operands A and B: In another form: NOT (A AND B) = (NOT A) OR (NOT B) NOT (A OR B) = (NOT A) AND (NOT B) The rules … Wikipedia